We have referred to electric networks from time to time as prime examples of systems amenable to graph theory methods. 我们经常地把电网络当作服从图论方法系统的最基本例子。
The forbidden subgraph problem is a prime example of the rather large family of extremal problems is graph theory. 禁向子图问题是图论中相当大的一类极值问题中的主要例子。
The basic character of prime number order cycle graph was studied by the method of construction, and me new lower bounds about some Ramsey numbers were obtained. 用构造性的方法研究了素数阶循环圈的基本性质,得到若干Ramsey数的新的下界。
A new prime order cyclic graph are structured, so lower bound of Ramsey number isobtained: R ( 4, 23) ≥ 272. 本文构造了1个新的素数阶循环圈,从而得到了1个Ramsey数的下界:R(4,23)≥272。
Using directed line graph and strongly connectivity of graph-we give new equivalent expressions of prime graph. 本义利用有向线图的概念及强连通性,给出了本原图的新表征。
Colouring prime distance graph and classification of distance set 素距离图的着色与距离集的分类